On A New Semantics for First-Order Predicate Logic
نویسندگان
چکیده
BLOCKIN We BLOCKIN BLOCKIN have BLOCKIN BLOCKIN been asked by the editors of the Journal of Philosophical Logic to write a short comment on his most recent work, published in this issue, based in part on a referee report by one of us, that, unfortunately, did not reach Aldo in time.
منابع مشابه
A Linear-Logic Semantics for Constraint Handling Rules
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate logic. However, the more CHR is used as a general-purpose programming language, the more the limitations of that kind of declarative semantics in modelling change become apparent. We propose an alternative declarative s...
متن کاملThe Semantics of Modal Predicate Logic I. Counterpart-Frames
We introduce a new semantics for modal predicate logic, with respect to which a rich class of first-order modal logics is complete, namely all normal first-order modal logics that are extensions of free quantified K. This logic is defined by combining positive free logic with equality PFL . = and the propositional modal logic K. We then uniformly construct—for each modal predicate logic L—a can...
متن کاملA New Execution Model for the logic of hereditary Harrop formulas
The class of first-order Hereditary Harrop formulas (fohh) is a well-established extension of first-order Horn clauses. Its operational semantics is based on intuitionistic provability. We propose another operational semantics for fohh which is based on game semantics. This new semantics has several interesting aspects: in particular, it gives a logical status to the read predicate. keywords: i...
متن کاملFirst-Order Modal Logic Theorem Proving and Standard PROLOG
Many attempts have been started to combine logic programming and modal logics. Most of them however, do not use classical PROLOG, but extend the PROLOG idea in order to cope with modal logic formulae directly. These approaches have the disadvantage that for each logic new logic programming systems are to be developed and the knowledge and experience gathered from PROLOG can hardly be utilized. ...
متن کاملContributions to the compositional semantics of first-order predicate logic
Henkin, Monk and Tarski gave a compositional semantics for first-order predicate logic. We extend this work by including function symbols in the language and by giving the denotation of the atomic formula as a composition of the denotations of its predicate symbol and of its tuple of arguments. In addition we give the denotation of a term as a composition of the denotations of its function symb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Philosophical Logic
دوره 46 شماره
صفحات -
تاریخ انتشار 2017